A Short Survey of P-ary Pseudo-random Sequences
نویسنده
چکیده
One of the most important problems in the sequence design is to find sequences with good correlation properties. Recently, expect for the binary Pseudo-Random Sequences (PRSs), much progress has been obtained for ternary and p-ary PRSs. In this paper a short survey of p-ary PRSs and their properties is made. As a result their classification is suggested without claiming its full completeness.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملm-Ary Hypervector Space: Convergent Sequences and Bundle Subsets.
In this paper, we have generalized the definition of vector space by considering the group as a canonical $m$-ary hypergroup, the field as a krasner $(m,n)$-hyperfield and considering the multiplication structure of a vector by a scalar as hyperstructure. Also we will be consider a normed $m$-ary hypervector space and introduce the concept of convergence of sequence on $m$-ary hypernormed space...
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملStatistical Properties of Modulo-p Added p-Ary Sequences
Binary sequences are the most fundamental random numbers and have been extensively used in several applications such as spread-spectrum CDMA communications and cryptosystems. M-sequences, Kasami sequences, and Gold sequences, all of which can be generated by linear feedback shift registers (LFSRs), are well known as conventional binary sequences [1]. It is also well known that chaos phenomena c...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014